منابع مشابه
Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices
A set system is L-intersecting if any pairwise intersection size lies in L, where L is some set of s nonnegative integers. The celebrated Frankl–Ray-Chaudhuri–Wilson theorems give tight bounds on the size of an L-intersecting set system on a ground set of size n. Such a system contains at most (n s ) sets if it is uniform and at most ∑s i=0 (n i ) sets if it is nonuniform. They also prove modul...
متن کاملPowerSet: A Comprehensive Visualization of Set Intersections
When analyzing a large amount of data, analysts often define groups over data elements that share certain properties. Using these groups as the unit of analysis not only reduces the data volume, but also allows detecting various patterns in the data. This involves analyzing intersection relations between these groups, and how the element attributes vary between these intersections. This kind of...
متن کاملSet-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, the k-wise intersections occupy only ` residue-classes modulo a p prime, while the sizes of the members of H are not in these residue classes, then the size of H is at most (k − 1) ∑̀
متن کاملFaster Adaptive Set Intersections for Text Searching
The intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine. In this paper we engineer a better algorithm for this task, which improves over those proposed by Demaine, Munro and López-Ortiz [SODA 2000/ALENEX 2001], by using a variant of interpolation search. More specifically, our contributions are threefold. First, we corrob...
متن کاملExtremal Set Systems with Weakly Restricted Intersections
Theorems on extremal set systems with intersections of restricted cardinality are probably among the most well-known and powerful theorems in extremal combinatorics. In this paper, we discuss the so-call ”weak” version of some theorems of this type, when the restricted intersection property is weakened by the possible existence of some (maybe many) intersections having ”bad” sizes. In particula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1981
ISSN: 0024-3795
DOI: 10.1016/0024-3795(81)90186-5